A project scheduling problem with periodically aggregated resource-constraints

We consider the so-called periodically aggregated resource-constrained project scheduling problem. This problem, introduced by Morin et al. (2017), is a variant of well-known problem that allows for more flexible usage resource constraints. While start and completion times activities can be arbitrary moments in time, limitations on are considered average over periods parameterized length. paper presents new theoretical experimental results this First, we settle complexity status proving NP-hardness number special cases Second, propose mixed-integer programming formulation disaggregating precedence constraints periods. A comparison shows dominates previously proposed one terms relaxation strength. Finally, carry out computational experiments instances from literature to compare merits different formulations.